Weak Dominance and Approximate Common Knowledge
نویسندگان
چکیده
منابع مشابه
Approximate common knowledge revisited
Suppose we replace ``knowledge'' by ``belief with probability p'' in standard de®nitions of common knowledge. Very di ̈erent notions arise depending on the exact de®nition of common knowledge used in the substitution. This paper demonstrates those di ̈erences and identi®es which notion is relevant in each of three contexts: equilibrium analysis in incomplete information games, best response dynam...
متن کاملIterated weak dominance and subgame dominance
In this paper, we consider finite normal form games satisfying transference of decisionmaker indifference. We show that any set of strategies surviving k rounds of elimination of some weakly dominated strategies can be reduced to a set of strategies equivalent to the set of strategies surviving k rounds of elimination of all weakly dominated strategies in every round by (at most k) further roun...
متن کاملWeak Dominance: a Mystery Cracked
What strategy profiles can be played when it is common knowledge that weakly dominated strategies are not played? A comparison to the case of strongly dominated strategy is in order. A common informal argument shows that if it is common knowledge that players do not play strongly dominated strategies then players can play only profiles that survive the iterative elimination of strongly dominate...
متن کاملIterated Weaker-than-Weak Dominance
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution accuracy. Equilibria of a game obtained by eliminating a δ-dominated strategy are guaranteed to be approximate equilibria of the original game, with degree of approximation bounded by the dominance parameter, δ. We can ...
متن کاملApproximate Weak Greedy Algorithms
We present a generalization of V. Temlyakov’s weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries. For a class of dictionaries with more structure, we give a more relaxed necessary and sufficient condition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 1994
ISSN: 0022-0531
DOI: 10.1006/jeth.1994.1067